منابع مشابه
Cacti 4.0
The original CACTI tool was released in 1994 to give computer architects a fast tool to model SRAM caches. It has been widely adopted and used since. Two new versions were released to add area and active power modeling to CACTI. This new version adds a model for leakage power and updates the basic circuit structure and device parameters to better reflect the advances in scaling semiconductors w...
متن کاملHitting Diamonds and Growing Cacti
We consider the following NP-hard problem: in a weighted graph, find a minimum cost set of vertices whose removal leaves a graph in which no two cycles share an edge. We obtain a constant-factor approximation algorithm, based on the primaldual method. Moreover, we show that the integrality gap of the natural LP relaxation of the problem is Θ(logn), where n denotes the number of vertices in the ...
متن کاملCacti, Braids and Complex Polynomials
The study of the topological classiication of complex polynomials began in the XIX-th century by Luroth (1871), Clebsch (1873) and Hurwitz (1891). In the works of Zdravkovska 23] and Khovanskii and Zdravkovska 17] the problem is reduced to a purely combinatorial one, that of the study of a certain action of the braid groups on a class of tree-like gures that we, following 14], call \cacti". Usi...
متن کاملCacti and filtered distributive laws
Motivated by the second author’s construction of a classifying space for the group of pure symmetric automorphisms of a free product, we introduce and study a family of topological operads, the operads of based cacti, defined for every pointed simplicial set .Y;p/ . These operads also admit linear versions, which are defined for every augmented graded cocommutative coalgebra C . We show that th...
متن کاملIndependent sets in chain cacti
In this paper chain cacti are considered. First, for two specific classes of chain cacti (orto-chains and meta-chains of cycles with h vertices) the recurrence relation for independence polynomial is derived. That recurrence relation is then used in deriving explicit expressions for independence number and number of maximum independent sets for such chains. Also, the recurrence relation for tot...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Botanical Gazette
سال: 1915
ISSN: 0006-8071
DOI: 10.1086/331590